#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define per(i, a, b) for (int i = (a); i >= (b); i--)
#define endl '\n'
const int N = 2e5 + 5;

mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());
int n, m;
int a[N];
int cnt[N];
void solve() {
  cin >> n >> m;
  rep(i, 1, n) cin >> a[i];
  rep(i, 0, n) cnt[i] = 0;
  rep(i, 1, n) cnt[a[i]]++;
  int x = 0, y = 0;
  rep(i, 0, m - 1) if (!cnt[i]) x++;
  y = cnt[m];
  cout << max(x, y) << endl;
}
int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  int t;
  cin >> t;
  while (t--) solve();
  return 0;
}